5 found
Order:
  1.  42
    The undecidability of the Turing machine immortality problem.Philip K. Hooper - 1966 - Journal of Symbolic Logic 31 (2):219-234.
  2.  22
    Michael Anderson. Approximation to a decision procedure for the halting problem. Notre Dame journal of formal logic, vol. 9 no. 4 , pp. 305–312. [REVIEW]Philip K. Hooper - 1970 - Journal of Symbolic Logic 35 (3):480.
  3.  12
    Michael Anderson. Note on the mortality problem for shift state trees. Notre Dame journal of formal logic, vol. 10 no. 3 , pp. 275–276. [REVIEW]Philip K. Hooper - 1971 - Journal of Symbolic Logic 36 (1):151.
  4.  16
    Review: Michael Anderson, Approximation to a Decision Procedure for the Halting Problem. [REVIEW]Philip K. Hooper - 1970 - Journal of Symbolic Logic 35 (3):480-480.
  5.  8
    Review: Michael Anderson, Note on the Mortality Problem for Shift State Trees. [REVIEW]Philip K. Hooper - 1971 - Journal of Symbolic Logic 36 (1):151-151.